A conjecture by Leon Ehrenpreis about zeroes of exponential polynomials
نویسنده
چکیده
then the ideal (F1, ..., FN) they generate in the Paley-Wiener algebra Ê ′(Rn) is slowly decreasing respect to the Paley-Wiener weight p(z) = log |z| + |Im z|. As a consequence, this ideal is closed in Ê ′(Rn). It coincides with the ideal [I(F1, ..., FN)]loc, which consists of elements in Ê ′(Rn) that belong locally to the ideal generated by F1, ..., FN in the algebra of entire functions in n variables.
منابع مشابه
Leon Ehrenpreis, recollections from the recent decades
Leon Ehrenpreis was an outstanding world class mathematician and a wonderful, warm person. I had a privilege to consider myself his friend for the last two decades. It is hard to do justice to his manifold mathematics and personality, but I will try to at least add some recollections to this tribute volume. Leon Ehrenpreis has been one of my mathematical heroes for about 40 years. I first encou...
متن کاملThe L 1 Ehrenpreis Conjecture
Let Σ be the algebraic universal cover of a closed surface of genus g > 1, T (Σ) its Teichmüller space, M(Σ,ℓ) the group of mapping classes stabilizing a fixed leaf ℓ. The L 1 Ehrenpreis conjecture asserts that M(Σ,ℓ) acts on T (Σ) with dense orbits in the L 1 topology (the topology coming from the L 1 norm on quadratic differentials). We give a proof of this weaker version of the Ehrenpreis co...
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
The Strong Factorial Conjecture of E. Edo and A. van den Essen [3] is concerned with the linear functional L on the space of complex polynomials defined by sending a monomial generator z1 1 · · · zn n to (a1!) · · · (an!). The conjecture asserts that for a non-zero multi-variable complex polynomial F , the maximum number of consecutive zeroes that may appear in the sequence {L(F ) : n ≥ 1} is N...
متن کاملOn the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کامل